1,659 research outputs found
Charge Scheduling of an Energy Storage System under Time-of-use Pricing and a Demand Charge
A real-coded genetic algorithm is used to schedule the charging of an energy
storage system (ESS), operated in tandem with renewable power by an electricity
consumer who is subject to time-of-use pricing and a demand charge. Simulations
based on load and generation profiles of typical residential customers show
that an ESS scheduled by our algorithm can reduce electricity costs by
approximately 17%, compared to a system without an ESS, and by 8% compared to a
scheduling algorithm based on net power.Comment: 13 pages, 2 figures, 5 table
Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning
In iterative methods for partitioning circuits, there is often a choice among several
modules which will all produce the largest available reduction in cut size if they are moved
between subsets in the partition. This choice, which is usually made by popping modules off
a stack, has been shown to have a considerable impact on performance. By considering the
most recent change in the potential reduction in cut size associated with moving each module
between subsets, the performance of this LIFO (last-in first-out) approach can be significantly
improved
A Memetic Lagrangian Heuristic for the 0-1 Multidimensional Knapsack Problem
We present a new evolutionary algorithm to solve the 0-1 multidimensional knapsack problem.
We tackle the problem using duality concept, differently from traditional approaches.
Our method is based on Lagrangian relaxation.
Lagrange multipliers transform the problem, keeping the optimality as well as decreasing the complexity.
However, it is not easy to find Lagrange multipliers nearest to the capacity constraints of the problem.
Through empirical investigation of Lagrangian space, we can see the
potentiality of using a memetic algorithm.
So we use a memetic algorithm to find the optimal Lagrange multipliers.
We show the efficiency of the proposed method by the experiments on well-known benchmark data
Feature Selection for Very Short-Term Heavy Rainfall Prediction Using Evolutionary Computation
We developed a method to predict heavy rainfall in South Korea with a lead time of one to six hours. We modified the AWS data for the recent four years to perform efficient prediction, through normalizing them to numeric values between 0 and 1 and undersampling them by adjusting the sampling sizes of no-heavy-rain to be equal to the size of heavy-rain. Evolutionary algorithms were used to select important features. Discriminant functions, such as support vector machine (SVM), k-nearest neighbors algorithm (k-NN), and variant k-NN (k-VNN), were adopted in discriminant analysis. We divided our modified AWS data into three parts: the training set, ranging from 2007 to 2008, the validation set, 2009, and the test set, 2010. The validation set was used to select an important subset from input features. The main features selected were precipitation sensing and accumulated precipitation for 24 hours. In comparative SVM tests using evolutionary algorithms, the results showed that genetic algorithm was considerably superior to differential evolution. The equitable treatment score of SVM with polynomial kernel was the highest among our experiments on average. k-VNN outperformed k-NN, but it was dominated by SVM with polynomial kernel
- …